On the number of types in sparse graphs

We prove that for every class of graphs C which is nowhere dense, as defined by Nešetřil and Ossona de Mendez [27, 28], and for every first order formula φ(x̄, ȳ), whenever one draws a graph G ∈ C and a subset of its nodes A, the number of subsets of A|ȳ| which are of the form {v̄ ∈ A|ȳ| : G |= φ(ū, v̄)} for some valuation ū of x̄ in G is bounded by O(|A||x̄|+ε), for every ε > 0. This provides optimal bounds on the VC-density of first-order definable set systems in nowhere dense graph classes. We also give two new proofs of upper bounds on quantities in nowhere dense classes which are relevant for their logical treatment. Firstly, we provide a new proof of the fact that nowhere dense classes are uniformly quasi-wide, implying explicit, polynomial upper bounds on the functions relating the two notions. Secondly, we give a new combinatorial proof of the result of Adler and Adler [1] stating that every nowhere dense class of graphs is stable. In contrast to the previous proofs of the above results, our proofs are completely finitistic and constructive, and yield explicit and computable upper bounds on quantities related to uniform quasi-wideness (margins) and stability (ladder indices).